Set cover problem

Results: 76



#Item
41A faster parameterized algorithm for set packing Ioannis Koutis Computer Science Department Carnegie Mellon University Pittsburgh, PAUSA

A faster parameterized algorithm for set packing Ioannis Koutis Computer Science Department Carnegie Mellon University Pittsburgh, PAUSA

Add to Reading List

Source URL: ccom.uprrp.edu

Language: English - Date: 2011-03-02 23:58:37
42CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Geometric Red-Blue Set Cover for Unit Squares and Related Problems Timothy M. Chan∗ Abstract

CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Geometric Red-Blue Set Cover for Unit Squares and Related Problems Timothy M. Chan∗ Abstract

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2013-08-11 21:51:56
43ICS 260 – Fall 2001 – Final Exam Name: Answer Key Student ID: 1:

ICS 260 – Fall 2001 – Final Exam Name: Answer Key Student ID: 1:

Add to Reading List

Source URL: www.ics.uci.edu

Language: English - Date: 2001-12-12 17:36:39
44CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Stabbing Polygonal Chains with Rays is Hard to Approximate Steven Chaplick∗ Elad Cohen†

CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Stabbing Polygonal Chains with Rays is Hard to Approximate Steven Chaplick∗ Elad Cohen†

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2013-08-11 21:51:57
45Parameterized Approximation via Fidelity Preserving Transformations Michael R. Fellows1 , Ariel Kulik2 , Frances Rosamond1 , and Hadas Shachnai3? 1 School of Engineering and IT, Charles Darwin Univ., Darwin, NT Australi

Parameterized Approximation via Fidelity Preserving Transformations Michael R. Fellows1 , Ariel Kulik2 , Frances Rosamond1 , and Hadas Shachnai3? 1 School of Engineering and IT, Charles Darwin Univ., Darwin, NT Australi

Add to Reading List

Source URL: www.cs.technion.ac.il

Language: English - Date: 2012-03-01 11:15:08
46CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximation Algorithms for the Minimum-Length Corridor and Related Problems Arturo Gonzalez-Gutierrez∗

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximation Algorithms for the Minimum-Length Corridor and Related Problems Arturo Gonzalez-Gutierrez∗

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-28 21:25:22
47CCCG 2011, Toronto ON, August 10–12, 2011 Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks Minati De∗†

CCCG 2011, Toronto ON, August 10–12, 2011 Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks Minati De∗†

Add to Reading List

Source URL: 2011.cccg.ca

Language: English - Date: 2011-08-06 04:11:13
48Blow-Ups, Win/Win’s, and Crown Rules: Some New Directions in FPT Michael R. Fellows School of Electrical Engineering and Computer Science University of Newcastle, University Drive, Callaghan NSW 2308, Australia mfellow

Blow-Ups, Win/Win’s, and Crown Rules: Some New Directions in FPT Michael R. Fellows School of Electrical Engineering and Computer Science University of Newcastle, University Drive, Callaghan NSW 2308, Australia mfellow

Add to Reading List

Source URL: www.mrfellows.net

Language: English - Date: 2009-10-05 20:16:31
49CCCG 2011, Toronto ON, August 10–12, 2011 Enumerating Minimal Transversals of Geometric Hypergraphs Khaled Elbassioni∗ Imran Rauf†

CCCG 2011, Toronto ON, August 10–12, 2011 Enumerating Minimal Transversals of Geometric Hypergraphs Khaled Elbassioni∗ Imran Rauf†

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2011-08-06 04:11:15
50CS109B Notes for LectureNP-Complete Problems We have met some problems that have \easy

CS109B Notes for LectureNP-Complete Problems We have met some problems that have \easy" solutions; they have algorithms that run in time that is polynomial in the size of the graph, the parameter m.  Examples:

Add to Reading List

Source URL: infolab.stanford.edu

Language: English - Date: 2008-09-19 00:58:50